Refinement-Based Planning as Satisfiability
نویسنده
چکیده
A classical planning problem is the problem of computing a sequence of actions that transforms one state of the world into the desired. Traditional planners cast planning as a "split & prune" type search. These are called "refinement planners" since they start with a null plan and refine it by adding constraints. It has been shown recently that planning problems are far easier to solve when they are cast as model finding problems [2]. Some schemes for automated generation of the encodings of the planning problems in propositional logic have been designed [1]. However these schemes lack several of the refinements and preprocessing that traditional planners use. Since no single encoding has been shown to have the smallest size and the best performance, it is necessary to know what the space of the encodings is, to make a more flexible and efficient exploration of the encodings possible. The plan refinements can proceed either in the forward direction (from initial state) or in the backward direction (from goal) or both. The steps of a plan can either be totally ordered (state space planning) or partially ordered (plan space or least commitment planning). The direction of refinement affects the branching factor in the search space and the nature of step ordering affects the completeness of the knowledge of the world state (complete world state is known in forward state space planning and causal planning is devoid of this knowledge). One can also do pre-processing to prune irrelevant information. These three dimensions show that many more novel plan encodings [4] exist. We discuss some encodings from this space here. 1. State Space Encodings There are two categories of these encodings linear and parallel. In linear encodings, only one action occurs at a time step. In parallel encodings, multiple actions can occur at the same time step, if they do not interfere. The state space encoding in [1] is not sensitive to the direction of refinement. Our encodings are sensitive to the direction of refinement (to enforce directional control in the declarative
منابع مشابه
A Planning Algorithm not based on Directional Search
The initiative in STRIPS planning has recently been taken by work on propositional satisfiability. Best current planners, like Graphplan, and earlier planners originating in the partial-order or refinement planning community have proved in many cases to be inferior to general-purpose satisfiability algorithms in solving planning problems. However, no explanation of the success of programs like ...
متن کاملCounting SAT-based Weighted Planning
Automated planning is one of the most important problems in artificial intelligence. We present a new refinement of the classical planning algorithm that formulates the planning problem as a satisfiability problem. Compared with previous techniques, the solution of the planning problem is identified using the number of truth assignments of the corresponding propositional formula and their actio...
متن کاملScalable Hardware Verification based on Datapath Abstraction, Counterexample-Guided Refinement, and Satisfiability Modulo Theories
We describe the Reveal formal functional verification system and its application to three representative hardware test cases. Reveal employs counterexample-guided abstraction refinement, or CEGAR, and is suitable for verifying the complex control logic of designs with wide datapaths. Reveal performs automatic datapath abstraction yielding an approximation of the original design with a much smal...
متن کاملA Novel Transition Based Encoding Scheme for Planning as Satisfiability
Planning as satisfiability is a principal approach to planning with many eminent advantages. The existing planning as satisfiability techniques usually use encodings compiled from the STRIPS formalism. We introduce a novel SAT encoding scheme based on the SAS+ formalism. It exploits the structural information in the SAS+ formalism, resulting in more compact SAT instances and reducing the number...
متن کاملDSatz: A Directional SAT Solver for Planning
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C, Nov. 2002, pp. 199-208.) SAT-based planners have been characterized as disjunctive planners that maintain a compact representation of search space of action sequences. Several ideas from refinement planners (conjunctive planners) h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998